Solving Constrained Graph Problems using Reachability Constraints based on Transitive Closure and Dominators

نویسندگان

  • Luis Quesada
  • Peter Van Roy
چکیده

To my wife, my parents and Fray Luis Amigó y Ferrer Acknowledgments The fulfillment of this thesis would not have been possible without the contribution of: • Peter Van Roy, my supervisor, who gave me the opportunity to work as a research assistant at Université Catholique de Louvain (UCL) from July 2001 until April 2005 in the MISURE project. The goal of the project was the development of a system capable of automatically managing the mission of an uninhabited air vehicle, which was expected to perform a mission in hostile territory almost without the support of human operators. The constrained paths problems involved in this project motivated the research presented in this thesis. • Yves Deville, who kindly accepted to co-supervise my thesis. His pragmatic aptitude and his long experience in constraint programming were essential in narrowing down the scope of the thesis and focusing on the fundamental issues. He also gave me the opportunity to work as a teaching assistant at UCL from October 2005 until August 2006. • Camilo Rueda, who supervised my B.Sc. thesis and let me join his research group at Pontificia Universidad Javeriana in 1996. Even though Camilo was not directly involved in the work of my Ph.D. thesis, the research I carried out under his supervision initiated me into the field of constraint programming. • Raphaël Collet, my genius colleague at UCL. The long discussions that we had were fundamental in helping me understand the concepts underlying my research. • Kevin Glynn, my English colleague at UCL. Apart from helping me with my English, his critical comments let me present my ideas in a more clear way. I must also say that Kevin's advice was of great help when the end of my thesis was not so certain. • Stefano Gualandi, my colleague in MISURE. The good results that we got in MISURE would not have been possible without Stefano. The fact that we were working on the same project provided us with lots of opportunities to interchange ideas. i ii Acknowledgments • Fred Spiessens, a very open minded colleague. The discussions I had with Fred led us to a nice application of the techniques presented in this thesis to the field of Computer Security. • Grégoire Dooms and Stephane Zampelli, who helped me in porting my Oz code to Gecode(CP(Graph)). I appreciate their patience in dealing with my naive questions. • Eugene Ressler, …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Dominators for Solving Constrained Path Problems

Constrained path problems have to do with finding paths in graphs subject to constraints. We present a constraint programming approach for solving the Ordered disjoint-paths problem (ODP), i.e., the Disjoint-paths problem where the pairs are associated with ordering constraints. In our approach, we reduce ODP to the Ordered simple path with mandatory nodes problem (OSPMN), i.e., the problem of ...

متن کامل

Parallel Processing of Graph Reachability in Databases 1

In this paper we consider parallel processing of a graph represented by a database relation, and we achieved two objectives. First, we propose a methodology for analyzing the speedup of a parallel processing strategy with the purpose of selecting at run-time one of several candidate strategies, depending on the hardware architecture and the input graph. Second, we study the single-source reacha...

متن کامل

Distributed Algorithms for the Transitive Closure

Many database queries, such as reachability and regular path queries, can be reduced to finding the transitive closure of the underlying graph. For calculating the transitive closure of large graphs, a distributed computation framework is required to handle the large data volume (which can approach O(|V |) space). Map Reduce was not originally designed for recursive computations, but recent wor...

متن کامل

Speeding Up Constrained Path Solvers with a Reachability Propagator

Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, it may be required that a node reaches a particular set of nodes by respecting some restrictions like visiting a particular set of nodes or edges and using less than a certain amount of resources. The reachability constr...

متن کامل

An Efficient Computation of Reachability Labeling for Social Networking Using Graph Pattern Mining: an Application of Data Mining

Graphs form a powerful modeling tool to represent complex relationships among objects in an effective manner. Graph pattern matching is one of the areas of data mining where the data is stored in the form of graphs and the set of tuples that match a user-given graph pattern are extracted. For finding the set of matching tuples faster, all the possible paths in the large directed graph, i.e., tr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006